A Finite Word Poset

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Finite Word Poset

Our word posets have finite words of bounded length as their elements, with the words composed from a finite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of such posets are established. Their automorphism groups are determined (along with similar result for the word poset studied by Burosch, Frank ...

متن کامل

Shortest path poset of finite Coxeter groups

We define a poset using the shortest paths in the Bruhat graph of a finite Coxeter group W from the identity to the longest word in W , w0. We show that this poset is the union of Boolean posets of rank absolute length of w0; that is, any shortest path labeled by reflections t1, . . . , tm is fully commutative. This allows us to give a combinatorial interpretation to the lowest-degree terms in ...

متن کامل

A Voronoi Poset

Given a set S of n points in general position, we consider all k-th order Voronoi diagrams on S, for k = 1, . . . , n, simultaneously. We deduce symmetry relations for the number of faces, number of vertices and number of circles of certain orders. These symmetry relations are independent of the position of the sites in S. As a consequence we show that the reduced Euler characteristic of the po...

متن کامل

Δ1-completions of a Poset

A join-completion of a poset is a completion for which each element is obtainable as a supremum, or join, of elements from the original poset. It is well known that the join-completions of a poset are in one-to-one correspondence with the closure systems on the lattice of up-sets of the poset. A ∆1-completion of a poset is a completion for which, simultaneously, each element is obtainable as a ...

متن کامل

A DOS-based POset implementation

In this paper, we describe and discuss a DOS based POset (i.e. Partially Ordered Set) implementation. We begin with a short review of previous results on POset based protection. We then describe implementation details of POset based protection under DOS. Next we discuss management tools used to implement and control the protection system. Then we describe the problems encountered in integration...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2000

ISSN: 1077-8926

DOI: 10.37236/1607